Optimizing Matrix Mapping with Data Dependent Kernel for Image Classification
نویسندگان
چکیده
Kernel based nonlinear feature extraction is feasible to extract the feature of image for classification.The current kernel-based method endures two problems: 1) kernelbased method is to use the data vector through transforming the image matrix into vector, which will cause the store and computing burden; 2) the parameter of kernel function has the heavy influences on kernel based learning method. In order to solve the two problems, we present the method of optimizing matrix mapping with data dependent kernel for feature extraction of the image for classification. The method implements the algorithm without transforming the matrix to vector, and it adaptively optimizes the parameter of kernel for nonlinear mapping. The comprehensive experiments are implemented evaluate the performance of the algorithms.
منابع مشابه
Using a Novel Concept of Potential Pixel Energy for Object Tracking
Abstract In this paper, we propose a new method for kernel based object tracking which tracks the complete non rigid object. Definition the union image blob and mapping it to a new representation which we named as potential pixels matrix are the main part of tracking algorithm. The union image blob is constructed by expanding the previous object region based on the histogram feature. The pote...
متن کاملObject-Based Classification of UltraCamD Imagery for Identification of Tree Species in the Mixed Planted Forest
This study is a contribution to assess the high resolution digital aerial imagery for semi-automatic analysis of tree species identification. To maximize the benefit of such data, the object-based classification was conducted in a mixed forest plantation. Two subsets of an UltraCam D image were geometrically corrected using aero-triangulation method. Some appropriate transformations were perfor...
متن کاملSparse Kernel Learning for Image Set Classification
No single universal image set representation can efficiently encode all types of image set variations. In the absence of expensive validation data, automatically ranking representations with respect to performance is a challenging task. We propose a sparse kernel learning algorithm for automatic selection and integration of the most discriminative subset of kernels derived from different image ...
متن کاملSVM classification of hyperspectral images based on wavelet kernel non-negative matrix factorization
This paper presents a new kernel framework for hyperspectral images classification. In this paper, a new feature extraction algorithm based on wavelet kernel non-negative matrix factorization (WKNMF) for hyperspectral remote sensing images is proposed. By using the feature of multi-resolution analysis, the new method can improve the nonlinear mapping capability of kernel non-negative matrix fac...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کامل